Decomposition of the complete bipartite multigraph into cycles and stars
نویسندگان
چکیده
منابع مشابه
Multigraph decomposition into stars and into multistars
We study the decomposition of multigraphs with a constant edge multiplicity into copies of a fixed starH =K1,t :We present necessary and sufficient conditions for such a decomposition to exist where t = 2 and prove NP-completeness of the corresponding decision problem for any t 3.We also prove NP-completeness when the edge multiplicity function is not restricted either on the input G or on the ...
متن کاملDecomposition of complete multigraphs into stars and cycles
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is the usual notation for the complete multigraph on n vertices and in which every edge is taken λ times. In this paper, we investigate necessary and sufficient conditions for the existence of the decomposition of λKn into edges disjoint of stars Sk’s and cycles Ck’s.
متن کاملEigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...
متن کاملDecomposition of complete bipartite multigraphs into paths and cycles having k edges
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), m, n ≥ k2 , m + n > k, and k(p + q) = 2mn for k ≡ 0(mod 2) and also when λ ≥ 3, λm ≡ λn ≡ 0(mod 2), k(p + q) = λmn, m, n ≥ k, (resp., m,n ≥ 3k/2) for k ≡ 0(mod 4) (re...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.02.019